package leetcode.weekly.week320;

import leetcode.helper.H;

public class Solution3Test extends H {

	public void debug4(Solution3 so) {
		H.compare(2, so.minimumFuelCost(H.str2array1("[[0,1],[1,2]]"), 3));
		H.compare(4, so.minimumFuelCost(H.str2array1("[[0,1],[0,2],[1,3],[1,4]]"), 5));
		H.compare(3, so.minimumFuelCost(H.str2array1("[[0,1],[0,2],[0,3]]"), 5));
		H.compare(7, so.minimumFuelCost(H.str2array1("[[3,1],[3,2],[1,0],[0,4],[0,5],[4,6]]"), 2));
	}

	public void debug3(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution3 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution3Test test = new Solution3Test();
		Solution3 so = new Solution3();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
